Optimal Quantization: Evolutionary Algorithm vs Stochastic Gradient

نویسندگان

  • Moez Mrad
  • Sana Ben Hamida
چکیده

We propose a new method based on evolutionary optimization for obtaining an optimal L-quantizer of a multidimensional random variable. First, we remind briefly the main results about quantization. Then, we present the classical gradient-based approach (this approach is well detailed in [2] and [7] for p=2) used up to now to find a “local” optimal L-quantizer. Then, we give an algorithm that permits to deal with the problem in the evolutionary optimization framework and illustrate a numerical comparison between the proposed method and the stochastic gradient method. Finally, a numerical application to option pricing in fi-

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Method for Optimal Quantization of the Normal Distribution

Quantization of a continuous-value signal into discrete form is a standard task in all analog/digital devices commonly used to solve numerical problems in finance. In this paper, we consider quantization of the Normal distribution. We suggest an hybrid technique based on the evolutionary optimization and the Stochastic Gradient for obtaining an optimal Lp-quantizer of a multidimensional random ...

متن کامل

QSGD: Randomized Quantization for Communication-Optimal Stochastic Gradient Descent

Parallel implementations of stochastic gradient descent (SGD) have received significant research attention, thanksto excellent scalability properties of this algorithm, and to its efficiency in the context of training deep neural networks.A fundamental barrier for parallelizing large-scale SGD is the fact that the cost of communicating the gradient updatesbetween nodes can be ve...

متن کامل

Optimal quantization methods and applications to numerical problems in finance

We review optimal quantization methods for numerically solving nonlinear problems in higher dimension associated with Markov processes. Quantization of a Markov process consists in a spatial discretization on finite grids optimally fitted to the dynamics of the process. Two quantization methods are proposed: the first one, called marginal quantization, relies on an optimal approximation of the ...

متن کامل

Approximation by quantization of the filter process and applications to optimal stopping problems under partial observation

We present an approximation method for discrete time nonlinear filtering in view of solving dynamic optimization problems under partial information. The method is based on quantization of the Markov pair process filter-observation (Π, Y ) and is such that, at each time step k and for a given size Nk of the quantization grid in period k, this grid is chosen to minimize a suitable quantization er...

متن کامل

Optimal quadratic quantization for numerics: the Gaussian case

Optimal quantization has been recently revisited in multi-dimensional numerical integration (see [18]), multi-asset American option pricing (see [1]), Control Theory (see [19]) and Nonlinear Filtering Theory (see [20]). In this paper, we enlighten some numerical procedures in order to get some accurate optimal quadratic quantization of the Gaussian distribution in higher dimension. We study in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006